T-SEPARATING SETS FOR COHERENT SEQUENCES
نویسندگان
چکیده
منابع مشابه
Minimal Separating Sets for
For a Muller automaton only a subset of its states is needed to decide whether a run is accepting or not: The set I the innnitely often visited states can be replaced by the intersection I \ W with a xed set W of states, provided W is large enough to distinguish between accepting and non-accepting loops in the automaton. We call such a subset W a separating set. Whereas the idea was previously ...
متن کاملOptimally separating sequences.
We consider the problem of separating two distinct classes of k similar sequences of length n over an alphabet of size s that have been optimally multi-aligned. An objective function based on minimizing the consensus score of the separated halves is introduced and we present an O(k3n) heuristic algorithm and two optimal branch-and-bound algorithms for the problem. The branch-and-bound algorithm...
متن کاملThin classes of separating sets
There are various definitions for a Martin–Pour-El theory in the literature. We isolate two such definitions: weak Martin–Pour-El theories (which correspond to perfect thin Π1 classes) and strong Martin–Pour-El theories (which correspond to thin classes of separating sets). By concentrating on constructions of appropriate Π1 classes, rather than on direct constructions of the theories, we show ...
متن کاملCoherent Sequences versus Radin Sequences
We attempt to make a connection between the sequences of measures used to deene Radin forcing and the coherent sequences of ex-tenders which are the basis of modern inner model theory. We show that in certain circumstances we can read oo sequences of measures as deened by Radin from coherent sequences of extenders, and that we can deene Radin forcing directly from a coherent extender sequence a...
متن کاملEfficient Collision Determination for Dynamic Scenes using Coherent Separating Axis
We present an efficient algorithm for collision determination of dynamic objects undergoing rigid motion or general deformation. Our technique deals with triangulated models, and it requires no further assumption of the objects’ geometry and topology. Particularly, it efficiently handles non-convex, or even polygon-soup models, enduring any deformation process. Furthermore, it requires no compl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Pure and Apllied Mathematics
سال: 2017
ISSN: 1311-8080,1314-3395
DOI: 10.12732/ijpam.v116i1.14